On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems
نویسنده
چکیده
Deterministic conditional rewrite systems permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive or quasi-simplifying, then it is terminating and has a computable rewrite relation. This paper provides new criteria for showing quasi-reductivity and quasi-simplifyingness. In this context, another criterion from ALS94] will be rectiied and a claim in Mar96] will be refuted. Moreover, we will investigate under which conditions the properties exhibit a modular behavior.
منابع مشابه
Formalized Confluence of Quasi-Decreasing, Strongly Deterministic Conditional TRSs
We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Loŕıa-Sáenz.
متن کاملTransforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
Deterministic conditional rewrite systems are interesting because they permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive, then it is terminating and has a computable rewrite relation. It will be shown that every deterministic CTRS R can be transformed into an unconditional TRS U(R) such that termination of U(R) implies quasi-reductivity of R. The m...
متن کاملOn Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems
We define the notion of context-sensitive quasi-reductivity which implies operational termination of deterministic conditional term rewriting systems. Furthermore, we show how existing transformations from such systems into unconditional ones can be used (with slight modifications) to prove context-sensitive quasi-reductivity. Finally, we give a few equivalent characterizations of this notion.
متن کاملCharacterizing and proving operational termination of deterministic conditional term rewriting systems
We investigate the practically crucial property of operational termination of deterministic conditional term rewriting systems (DCTRSs), an important declarative programming paradigm. We show that operational termination can be equivalently characterized by the newly introduced notion of context-sensitive quasi-reductivity. Based on this characterization and an unraveling transformation of DCTR...
متن کاملA Deterministic Lazy Conditional Narrowing Calculus
(We show the completeness of a deterministic lazy conditional narrowing calculus with leftmost selection for the class of eft-linear fresh deterministic constructorbased conditional rewrite systems. This class of rewrite systems permits extra variables in the right-hand sides and conditions of its rewrite rules. This result is relevant for the designers of suitable computational models for func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999